Stability of Locally Optimal Solutions
نویسندگان
چکیده
Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general setting. Properties of prox-regularity of the essential objective function and positive definiteness of its coderivative Hessian are the key to these results. A previous characterization of tilt stability comes out as a special case.
منابع مشابه
Full Stability of Locally Optimal Solutions in Second-Order Cone Programs
The paper presents complete characterizations of Lipschitzian full stability of locally optimal solutions to problems of second-order cone programming (SOCP) expressed entirely in terms of their initial data. These characterizations are obtained via appropriate versions of the quadratic growth and strong second-order sufficient conditions under the corresponding constraint qualifications. We al...
متن کاملLipschitz Stability of Solutions Toparametric Optimal
A class of parametric optimal control problems for semilinear parabolic equations is considered. Using recent regularity results for solutions of such equations, suucient conditions are derived under which the solutions to optimal control problems are locally Lipschitz continuous functions of the parameter in the L 1-norm. It is shown that these conditions are also necessary, provided that the ...
متن کاملLipschitz Stability of Solutions Toparametric Optimal Control
A class of parametric optimal control problems for semilinear parabolic equations is considered. Using recent regularity results for solutions of such equations, suucient conditions are derived under which the solutions to optimal control problems are locally Lipschitz continuous functions of the parameter in the L 1-norm. It is shown that these conditions are also necessary, provided that the ...
متن کاملLipschitz Stability of Solutions
A class of parametric optimal control problems for semilinear parabolic equations is considered. Using recent regularity results for solutions of such equations, suucient conditions are derived under which the solutions to optimal control problems are locally Lipschitz continuous functions of the parameter in the L 1-norm. It is shown that these conditions are also necessary, provided that the ...
متن کاملA polynomial training algorithm for calculating perceptrons of optimal stability
Recomi (Repeated correlation matrix inversion) is a polynomially fast algorithm for searching optimally stable solutions of the perceptron learning problem. For random unbiased and biased patterns it is shown that the algorithm is able to find optimal solutions, if any exist, in at worst O(N) floating point operations. Even beyond the critical storage capacity αc the algorithm is able to find l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 10 شماره
صفحات -
تاریخ انتشار 2000